The Inter-group Router Approach to Scalable Group Composition

نویسندگان

  • Scott Iekel-Johnson
  • Farnam Jahanian
  • Jigney Shah
چکیده

This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups, while maintaining well-defined end-to-end delivery semantics. We propose a new architecture which supports modular group composition by providing a distinction between intra-group and inter-group communication. With this architecture, multiple group communication protocols and end-to-end delivery semantics can be used in a single system. These features reduce the complexity of ordering messages in a group composition, resulting in enhanced scalability. Finally, we present simulation results comparing the performance of a group composition using our architecture to that of a single process group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Group Composition with End-to-end Delivery Semantics

This paper examines the problem of building scalable, fault-tolerant distributed systems from collections of communicating process groups while maintaining well-deened end-to-end delivery semantics. Our approach to inter-group communication takes advantage of modular group composition. We introduce a generic model which provides a distinction between intra-group and inter-group communication, a...

متن کامل

Scalable IP Multicast Sender Access Control for Bi-directional Trees

Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is important to perform sender access control so as to prevent group members from receiving irrelevant data, and also protect the multicast tree from various Denial-of-Service (DoS) attacks. Compared with source specific tree...

متن کامل

Scalable sender access control for bi-directional multicast routing

Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is important to support sender access control in order to prevent group members from receiving irrelevant data, and also to protect the multicast tree from Denial-of-Service (DoS) attacks. Compared with source specific and un...

متن کامل

Center Selection and Migration for Wide - area

Interdomain multicast routing is a challenge, requiring a scalable solution that is suitable for diverse application characteristics. Center-based routing trees overcome some of the limitations associated with traditional shortest-path tree routing, however they present a new set of routing problems. Speciically, the choice of the center router can be critical in determining the multicast routi...

متن کامل

تشخیص اجتماعات ترکیبی در شبکه‌های اجتماعی

One of the great challenges in Social Network Analysis (SNA) is community detection. Community is a group of vertices which have high intra connections and sparse inter connections. Community detection or Clustering reveals community structure of social networks and hidden relationships among their constituents. By considering the increase of datasets related to social networks, we need scalabl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999